منابع مشابه
Non-uniform Deblurring for Shaken Images: Derivation of parameter update equations for blind de-blurring
This note outlines the derivation of the parameter update formulas for the variational non-uniform blind deblurring algorithm described in Whyte et al. [4]. First, using the calculus of variations, we find the optimal forms of the factorized approximating distributions and arrive at the same formulas as in the uniform blind deblurring of Miskin & MacKay [3] and Fergus et al. [2]. Next, we deriv...
متن کاملNon-uniform Motion Deblurring for Camera Shakes
This paper presents a novel blind motion deblurring algorithm for dealing with non-uniform motion blurs caused by camera shakes. Conventional motion deblurring algorithms assume the blur can be described by a uniform point spread function (PSF). However, this assumption is typically invalid in practice. We exploit a new representation of motion blurs which models the blur effects of camera shak...
متن کاملRegistration Based Non-uniform Motion Deblurring
This paper proposes an algorithm which uses image registration to estimate a non-uniform motion blur point spread function (PSF) caused by camera shake. Our study is based on a motion blur model which models blur effects of camera shakes using a set of planar perspective projections (i.e., homographies). This representation can fully describe motions of camera shakes in 3D which cause non-unifo...
متن کاملNon-Uniform Blind Deblurring with a Spatially-Adaptive Sparse Prior
Typical blur from camera shake often deviates from the standard uniform convolutional script, in part because of problematic rotations which create greater blurring away from some unknown center point. Consequently, successful blind deconvolution requires the estimation of a spatially-varying or non-uniform blur operator. Using ideas from Bayesian inference and convex analysis, this paper deriv...
متن کاملFast Non-uniform Deblurring using Constrained Camera Pose Subspace
where Kθ is the matrix that warps latent image L to the transformed copy at a sampled pose θ and S denotes the set of sampled camera poses. While these algorithms show promising results, they entail high computational cost as the high-dimensional camera motion space and the latent image have to be computed during the iterative optimization procedures. In this paper, we propose a fast single-ima...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Computer Vision
سال: 2011
ISSN: 0920-5691,1573-1405
DOI: 10.1007/s11263-011-0502-7